Recursive Coalgebras from Comonads

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive coalgebras from comonads

We discuss Osius’s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functor-coalgebra that are based on comonads, comonad-coalgebras and distributive laws.

متن کامل

Covarieties of Coalgebras: Comonads and Coequations

Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic morphisms, and subcoalgebras defined by split equalisers. A covariety has the stronger property of closure under all subcoalgebras, and is behavioural if it is closed under domains of morphisms, or equivalently under ima...

متن کامل

Recursive coalgebras of finitary functors

For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.

متن کامل

Signals and Comonads

We propose a novel discipline for programming stream functions and for the semantic description of stream manipulation languages based on the observation that both general and causal stream functions can be characterized as coKleisli arrows of comonads. This seems to be a promising application for the old, but very little exploited idea that if monads abstract notions of computation of a value,...

متن کامل

Comonads and Galois Corings

The notion of a coring was introduced by M. E. Sweedler in [20] with the objective of formulating and proving a predual to the Jacobson-Bourbaki theorem for extensions of division rings. A fundamental argument in [20] is the following: given division rings E ⊆ A, each coideal J of the A–coring A ⊗E A gives rise to a factor coring C = A ⊗E A/J . If g ∈ C denotes the group-like element 1 ⊗E 1 + J...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2004

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.02.034